package com.snopy.leetcode.index1_1000.index801_900;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 * @author snopy
 * @version 1.0.0
 * @classname Question804
 * @description 唯一摩尔斯密码词 easy
 * 国际摩尔斯密码定义一种标准编码方式，将每个字母对应于一个由一系列点和短线组成的字符串，比如:
 *
 * 'a' 对应 ".-" ，
 * 'b' 对应 "-..." ，
 * 'c' 对应 "-.-." ，以此类推。
 * 为了方便，所有 26 个英文字母的摩尔斯密码表如下：
 *
 * [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
 * 给你一个字符串数组 words ，每个单词可以写成每个字母对应摩尔斯密码的组合。
 *
 * 例如，"cab" 可以写成 "-.-..--..." ，(即 "-.-." + ".-" + "-..." 字符串的结合)。我们将这样一个连接过程称作 单词翻译 。
 * 对 words 中所有单词进行单词翻译，返回不同 单词翻译 的数量。
 *
 * 
 *
 * 示例 1：
 *
 * 输入: words = ["gin", "zen", "gig", "msg"]
 * 输出: 2
 * 解释: 
 * 各单词翻译如下:
 * "gin" -> "--...-."
 * "zen" -> "--...-."
 * "gig" -> "--...--."
 * "msg" -> "--...--."
 *
 * 共有 2 种不同翻译, "--...-." 和 "--...--.".
 * 示例 2：
 *
 * 输入：words = ["a"]
 * 输出：1
 *
 * @email 77912204@qq.com
 * @date 2022/04/10 11:45
 */
public class Question804 {
    final String[] MORSE = new String[]{".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};

    public static void main(String[] args) {
        Question804 demo = new Question804();
        String [] arrs = new String[]{"a", "zen", "gig", "msg"};
        int i = demo.uniqueMorseRepresentations(arrs);
        System.out.println(i);
    }
    public int uniqueMorseRepresentations(String[] words) {
        if (words.length<1){
            return 0;
        }
        Set<String> set = new HashSet<>();
        for (String word : words) {
            StringBuilder s = new StringBuilder();
            for (int i = 0; i < word.length(); i++) {
                s.append(MORSE[word.charAt(i)-'a']);
            }
            set.add(s.toString());
        }

        return set.size();
    }
}
